Causal Recursive Parameter Estimation for Discrete-Time Hidden Bivariate Markov Chains
نویسندگان
چکیده
منابع مشابه
Recursive Smoothers for Hidden Discrete-time Markov Chains
Hidden Markov chains have been the subject of extensive studies, see the books [1, 2] and the references therein. Of particular interest are the discret-time, finite-state hidden Markov models. In this paper, using the same techniques as in [3], we propose results that improve the finite-dimensional smoothers of functionals of a partially observed discrete-time Markov chain. The model itself ex...
متن کاملRecursive Parameter Estimation for Partially Observed Markov Chains
Using the reference probability method, a recursive equation is obtained for the unnormalized joint conditional density of a noisily observed Markov chain, and parameters which determine the transition densities and coefficients in the observations.
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملRecursive Estimation in Hidden Markov Models
We consider a hidden Markov model (HMM) with multidimensional observations, and where the coefficients (transition probability matrix, and observation conditional densities) depend on some unknown parameter. We study the asymptotic behaviour of two recursive estimators, the recursive maximum likelihood estimator (RMLE), and the recursive conditional least squares estimator (RCLSE), as the numbe...
متن کاملHierarchical Counterexamples for Discrete-Time Markov Chains
This paper introduces a novel counterexample generation approach for the verification of discrete-time Markov chains (DTMCs) with two main advantages: (1) We generate abstract counterexamples which can be refined in a hierarchical manner. (2) We aim at minimizing the number of states involved in the counterexamples, and compute a critical subsystem of the DTMC whose paths form a counterexample....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2408557